Extracting a DPLL Algorithm
نویسندگان
چکیده
منابع مشابه
Extracting a DPLL Algorithm
We formalize a completeness proof for the DPLL proof system and extract a DPLL SAT solver from it. When applied to a propositional formula in conjunctive normal form the program produces either a satisfying assignment or a DPLL derivation which shows that it is unsatisfiable. We use non-computational quantifiers to remove redundant computational content from the extracted program and improve it...
متن کاملExtracting verified decision procedures: DPLL and Resolution
This article is concerned with the application of the program extraction technique to a new class of problems: the synthesis of decision procedures for the classical satisfiability problem that are correct by construction. To this end, we formalize a completeness proof for the DPLL proof system and extract a SAT solver from it. When applied to a propositional formula in conjunctive normal form ...
متن کاملA DPLL Algorithm with Literal Renaming Strategy
Restricted on the proof of unsatisfiability of unsatisfiable formulas, a modified DPLL — RSMLS algorithm is presented. The new algorithm has a symmetry rule (Literal renaming ) and three simplified rule ((1,*)-Resolution, Subformula, and Multiple ). As an example, RSMLS algorithm is applied for the proof of unsatisfiability of pigeon-hole formula . We show with respect to RSMLS algorithm that h...
متن کاملA DPLL Algorithm for Solving DQBF
Dependency Quantified Boolean Formulas (DQBF) comprise the set of propositional formulas which can be formulated by adding Henkin quantifiers to Boolean logic. We are not aware of any published attempt in solving this class of formulas in practice. However with DQBF being NEXPTIME-complete, efficient ways of solving it would have many practical applications. In this paper we describe a DPLL-sty...
متن کاملAbstract DPLL and Abstract DPLL Modulo Theories
DPLL and Abstract DPLL Modulo TheoriesDPLL Modulo Theories Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli ?? Abstract. We introduce Abstract DPLL, a general and simple abstract We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davis-Putnam-Logemann-Loveland (DPLL) procedure. Its properties, such as soundness, completeness or termination, immediatel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2012
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2012.08.016